A note on the submodular vertex cover problem with submodular penalties
نویسندگان
چکیده
منابع مشابه
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
We investigate two new optimization problems — minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require ...
متن کاملThe Fault-Tolerant Facility Location Problem with Submodular Penalties
In this paper, we consider the fault-tolerant facility location problem with submodular penalties that is a common generalization of the fault-tolerant facility location problem and the facility location problem with submodular penalties. For this problem, we present a combinatorial 3 ·HR-approximation algorithm, where R is the maximum connectivity requirement and HR is the R-th harmonic number...
متن کاملThe Minimum Entropy Submodular Set Cover Problem
We study minimum entropy submodular set cover, a variant of the submodular set cover problem (Wolsey [22], Fujito [11], etc) that generalizes the minimum entropy set cover problem (Halperin and Karp [12], Cardinal et al. [5]) We give a general bound of the approximation performance of the greedy algorithm using an approach that can be interpreted in terms of a particular type of biased network ...
متن کاملGreedy approximations for minimum submodular cover with submodular cost
It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ )-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ ) is the γ -th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonl...
متن کاملMinimizing Sparse High-Order Energies by Submodular Vertex-Cover
Inference in high-order graphical models has become important in recent years. Several approaches are based, for example, on generalized message-passing, or on transformation to a pairwise model with extra ‘auxiliary’ variables. We focus on a special case where a much more efficient transformation is possible. Instead of adding variables, we transform the original problem into a comparatively s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.10.017